OPTIMUM REQUIREMENT HAMILTON CYCLE PROBLEM WITH A MONGE-LIKE PROPERTY
نویسندگان
چکیده
منابع مشابه
Mum Requirement Hamilton Cycle Problem with a Monge-like Property
Given a simple graph G with a vertex set V and a set of "requirements" {rvw \ v , w E V}, we consider a problem to find a Hamilton cycle minimizing an objective function similar to that in the optimum requirement spanning tree (ORST) problem studied by Hu. And we show that a particular Hamilton cycle C" which is explicitly definable is a solution to the problem when G is complete and { r v w } ...
متن کاملA Generalized Optimum Requirement Spanning Tree Problem with a Monge-like Property
We consider a generalized optimum requirement spanning tree problem (GORST problem) which is an extension of the problem studied by Hu. In the GORST problem, the degrees of vertices are restricted and the objective function is generalized. We will show that a particular tree T*, which is obtained by a sort of greedy algorithm but is explicitly definable, is a solution to the GORST problem when ...
متن کاملA pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the largest utility, which is defined to be the difference between the benefit and the price of the item. The optimization problem is to decide on the prices that maximize total revenue of the seller. This problem is also call...
متن کاملTraveling salesman games with the Monge property
Several works have indicated the relationships between polynomially solvable combinatorial optimization problems and the core non-emptiness of cooperative games associated with them, and between intractable combinatorial optimization problems and the hardness of the problem to decide the core non-emptiness of the associated games. In this paper, we study the core of a traveling salesman game, w...
متن کاملMass Transportation, the Monge-Kantorovich problem, Hamilton-Jacobi equation and metrics on measure-valued functions
Consider a cloud of particles (say, a smoke cloud) drifted in the atmosphere. We can measure the density of the cloud at any instant of time we wish. What can we say about its velocity? This question looks rather naive, since velocity is just the rate of change of position. Indeed, if the cloud is composed of a single (or few) particles then we can easily identify two close particles at times t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2002
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.45.36